Long Chains of Nearly Doubled Primes
نویسنده
چکیده
A chain of nearly doubled primes is an ordered set {a\,ai,... ,a\} of prime numbers, interlinked by o^ = 2a^_i ± 1. A search for long chains of this kind has been performed in the range a\ < 250. Chains of length up to 13 have been found. Shorter chains have been counted in some restricted ranges. Some of these counts are compared with the frequencies predicted by a quantitative version of the prime fc-tuples conjecture.
منابع مشابه
Distinct Fuzzy Subgroups of a Dihedral Group of Order $2pqrs$ for Distinct Primes $p, , q, , r$ and $s$
In this paper we classify fuzzy subgroups of the dihedral group $D_{pqrs}$ for distinct primes $p$, $q$, $r$ and $s$. This follows similar work we have done on distinct fuzzy subgroups of some dihedral groups.We present formulae for the number of (i) distinct maximal chains of subgroups, (ii) distinct fuzzy subgroups and (iii) non-isomorphic classes of fuzzy subgroups under our chosen equival...
متن کاملA Note on Shanks's Chains of Primes
For integers a and b we deene the Shanks chain p 1 ; p 2 ; : : : ; p k of length k to be a sequence of k primes such that p i+1 = ap i 2 ? b for i = 1; 2; : : : ; k ? 1. While for Cunningham chains it is conjectured that innnitely long chains exist, this is, in general, not true for Shanks chains. In fact, with s = ab we show that for all but 56 values of s 1000 any corresponding Shanks chain m...
متن کاملOn Silverman's conjecture for a family of elliptic curves
Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...
متن کاملOn Fast Calculation of Addition Chains for Isogeny-Based Cryptography
Addition chain calculations play a critical role in determining the e ciency of cryptosystems based on isogenies on elliptic curves. However, nding a minimal length addition chain is not easy; a generalized version of the problem, in which one must nd a chain that simultaneously forms each of a sequence of values, is NP-complete. For the special primes used in such cryptosystems, nding fast add...
متن کاملA Robust Modeling Of Inventory Routing In Collaborative Reverse Supply Chains
This paper proposes a robust model for optimizing collaborative reverse supply chains. The primary idea is to develop a collaborative framework that can achieve the best solutions in the uncertain environment. Firstly, we model the exact problem in the form of a mixed integer nonlinear programming. To regard uncertainty, the robust optimization is employed that searches for an optimum answer wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010